Synthesis of Supervised Controller Based on Boolean Constraints and Boolean Automata

In order to establish a method to synthesis controllers, an essential step is the modelling of both plant and constraints. However, this step remains a very complex task. To mitigate this difficulty and facilitate modelling, we present a methodology for plant modelling based on rules; as well as a user friendly methodology for constraints modelling based on logical equations in the traditional Boolean algebra. Then, we present an adaptation of the Kumar algorithm synthesis adequated to these new modelling. To conclude, we show that our synthesis approach can constitute a help in controller development and to be diverted from its first function to be used in controller validation. Copyright © 2006 IFAC Key word: Boolean Automata, plant model, constraint model, supervisory control theory, Boolean algebra, validation, controller development.